Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach

نویسندگان

چکیده

Telecommunication networks frequently face technological advancements and need to upgrade their infrastructure. Adapting legacy the latest technology requires synchronized technicians responsible for migrating equipment. The goal of network migration problem is find an optimal plan this process. This a defining step in customer acquisition telecommunications service suppliers, its outcome directly impacts owners' purchasing behaviour. We propose first exact method problem, logic-based Benders decomposition approach that benefits from hybrid constraint programming-based column generation master programming model subproblem. integrated solution technique applicable any integer with similar structure, most notably vehicle routing node synchronization constraints. Comprehensive evaluation our over instances based on six real demonstrates computational efficiency algorithm obtaining quality solutions. also show merit each incorporated optimization paradigm achieving performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

Logic-Based Benders Decomposition

Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...

متن کامل

Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition

We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capacity constraints, and the allocation of the customers to trucks at those facilities under per truck traveldistance constraints. We present a hybrid approach that combines integer programming and constraint programming using logic...

متن کامل

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem

We consider the 3-staged Strip Packing Problem, in which rectangular items have to be arranged onto a rectangular strip of fixed width, such that the items can be obtained by three stages of guillotine cuts while the required strip height is to be minimized. We propose a new logic-based Benders decomposition with two kinds of Benders cuts and compare it with a compact integer linear programming...

متن کامل

Robust Scheduling with Logic-Based Benders Decomposition

We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informs Journal on Computing

سال: 2023

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2023.1280